Resistant sets in the unit hypercube
نویسندگان
چکیده
Ideal matrices and clutters are prevalent in Combinatorial Optimization, ranging from balanced matrices, clutters of T -joins, to clutters of rooted arborescences. Most of the known examples of ideal clutters are combinatorial in nature. In this paper, rendered by the recently developed theory of cuboids, we provide a different class of ideal clutters, one that is geometric in nature. The advantage with this new class of ideal clutters is that it allows for infinitely many ideal minimally nonpacking clutters. We characterize the densest ideal minimally nonpacking clutters of the class.
منابع مشابه
A computational method to analyze the similarity of biological sequences under uncertainty
In this paper, we propose a new method to analyze the difference and similarity of biological sequences, based on the fuzzy sets theory. Considering the sequence order and some chemical and structural properties, we present a computational method to cluster the biological sequences. By some examples, we show that the new method is relatively easy and we are able to compare the sequences of arbi...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملHypercube Embedding of Distances with Few Values Hypercube Embedding of Distances with Few Values
A distance d on a nite set V is hypercube embeddable if it can be isometrically embedded into the hypercube f0; 1g m for some m 1, i.e., if the elements i 2 V can be labeled by sets A i in such a way that d(i; j) = jA i 4A j j for all i; j 2 V. Testing whether a distance d is hypercube embeddable is an NP-complete problem, even if d is assumed to take its values in f2; 3; 4; 6g ((Chv80]). On th...
متن کاملA parallel sort-balance mutual range-join algorithm on hypercube computers
This paper presents an eecient parallel algorithm for computing the mutual range-join of N sets of numbers on shared-nothing hypercube computers. The algorithm iteratively joins each set to the mutual range-join of the preceding sets. Each join is performed on all processors of the hypercube in parallel. The algorithm uses a global sorting method to distribute the elements of the rst set evenly...
متن کاملAddition as fuzzy mutual entropy
A sum of real numbers equals the mutual entropy of a fuzzy set and its complement set. A " fuzzy " or multivalued set is a point in a unit hypercube. Fuzzy mutual (Kullback) entropy arises from the logarithm of a unique measure of fuzziness. The proof uses the logistic map, a diffeomorphism that maps extended real space onto the fuzzy cube embedded in it. The logistic map equates the sum of a v...
متن کامل